An Air Force Crew Allocation and Scheduling Problem
نویسندگان
چکیده
منابع مشابه
Air-Crew Scheduling through Abduction
This paper presents the design and implementation of an aircrew assignment system based on the Artificial Intelligence principles and techniques of abductive reasoning as captured by the framework of Abductive Logic Programming (ALP). The aim of this work was to produce a system for Cyprus Airways that can be used to provide a solution to the airline’s crew scheduling problem whose quality was ...
متن کاملOptimized Crew Scheduling at Air New Zealand
E. Rod Butchers Network Logistics, Air New Zealand Ltd. Private Bag 92007, Auckland, New Zealand Paul R. Day Optimal Decision Technologies Ltd. P.O. Box 128-233, Remuera, Auckland, New Zealand Andrew P. Goldie Optimal Decision Technologies Ltd. Stephen Miller Network Logistics, Air New Zealand Ltd. Jeff A. Meyer Optimal Decision Technologies Ltd. David M. Ryan Department of Engineering Science,...
متن کاملThe crew timetabling problem: An extension of the crew scheduling problem
In some urban transportation companies driving periods are short when compared with the total duty time, leading to long non-driving periods that can be used as cover time. This paper presents the Crew Timetabling Problem, an extension of the Crew Scheduling Problem in which crew timetables are obtained by levelling the cover crew resources. An objective function for this problem is proposed in...
متن کاملTwo Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملAn efficient estimation function for the crew scheduling problem
In this paper we explain an estimation function for the crew scheduling problem in the coach transportation domain. Thanks to this function we obtain an estimation that is very close to the real cost of the solution and we can efficiently prune the search space with a branch and bound approach. Consequently we find the optimal solution in less time than with other estimations such as the Russian
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 1984
ISSN: 0160-5682,1476-9360
DOI: 10.1057/jors.1984.16